A survey of some open questions in reconstruction numbers
نویسندگان
چکیده
Frank Harary contributed numerous questions to a variety of topics in graph theory. One of his favourite topics was the Reconstruction Problem which, in its first issue in 1977, the Journal of Graph Theory described as the major unsolved problem in the field. Together with Plantholt, Frank Harary initiated the study of reconstruction numbers of graphs. We shall here present a survey of some of the work done on reconstruction numbers, focusing mainly on the questions which this work leaves open.
منابع مشابه
Evidence-Based ACL Reconstruction
There is controversy in the literature regarding a number of topics related to anterior cruciate ligament (ACL)reconstruction. The purpose of this article is to answer the following questions: 1) Bone patellar tendon bone (BPTB) reconstruction or hamstring reconstruction (HR); 2) Double bundle or single bundle; 3) Allograft or authograft; 4) Early or late reconstruction; 5) Rate of return to sp...
متن کاملThe vertex and edge graph reconstruction numbers of small graphs
First posed in 1942 by Kelly and Ulam, the Graph Reconstruction Conjecture is one of the major open problem in graph theory. While the Graph Reconstruction Conjecture remains open, it has spawned a number of related questions. In the classical vertex graph reconstruction number problem a vertex is deleted in every possible way from a graph G, and then it can be asked how many (both minimum and ...
متن کاملFeasibility of Obtaining Sufficient Numbers of Responses to Questions About Travel Intentions, Thereby Facilitating Effective Health Messaging
Introduction: The medical literature has identified a variety of health risks associated with travel. Risks depend on the susceptibility of the traveler, the specifics of the destination, the mode of transport, and on chance events. Ill-prepared travelers who underestimate travel risks may encounter a variety of health problems. In order to eventually increase the capability of...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملReasons for Creation of Important and Sacred Numbers and Their Reflections in Architectural and Urban Spaces
This research was an attempt to study reasons for creation of some of the important and sacred numbers and their reflection in architectural and urban spaces. This subject matter is important because significant and sacred numbers were used in design and construction of a number of historical spaces. The research objective was to discover some of the reasons for formation of important and sacre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 97 شماره
صفحات -
تاریخ انتشار 2010